Vertex labeling and routing in expanded Apollonian networks

نویسندگان

  • Zhongzhi Zhang
  • Francesc Comellas
  • Guillaume Fertin
  • André Raspaud
  • Lili Rong
  • Shuigeng Zhou
چکیده

We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their nodes that allows one to determine a shortest path routing between any two nodes of the network based only on the labels. PACS numbers: 02.10.Ox, 89.20.Ff, 89.75.Da, 89.75.-k Vertex labeling and routing in expanded Apollonian networks 3

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks

We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their vertices that allows to determine a shortest path routing between any two vertices of the network based only on the labels.

متن کامل

Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs

The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by adding a special vertex linked to all its three extreme vertices. In this paper, we study analytically maximum matchings and minimum dominating sets in Apoll...

متن کامل

Compact Routing on Chordal Rings of Degree Four yLata

A chordal ring G(n; c) of degree 4 is a ring of n nodes with chords connecting each vertex i to the vertex (i + c) mod n. In this paper, we investigate compact routing schemes on such networks. We show a routing scheme for any such network that requires O(log n) bits of storage at each node, and O(1) time to compute a shortest path to any destination. This improves on the results of 16] which g...

متن کامل

Performance Improvement of Expanded Integrated Local Area Networks (RESEARCH NOTE)

In Local Area Networks (LAN) connected together by bridges, flow control and smooth traffic in the network is very important. However, congestion at bridges can cause intensive loss of received frames. In addition, the received frames are thrown away and have to be retransmitted by the source station, which causes more congestion and massive reduction in the overall network throughput. The netw...

متن کامل

A Survey of Solutions to Protect Against All Types of Attacks in Mobile Ad Hoc Networks

In recent years mobile networks have expanded dramatically, compared with other wireless networks. Routing protocols in these networks are designed with the assumption that there is no attacker node, so routing protocols are vulnerable to various attacks in these networks. In this paper, we review the network layer attacks and then we simulate the impact of black hole attack on ad hoc on demand...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007